Refinement Planning and Acting
نویسندگان
چکیده
In several publications over the past few years, we argued that the automated planning research literature has underestimated the importance and difficulty of deliberative acting. We have outlined an algorithm, RAE, for deliberative acting. We now give give an overview of SeRPE, a planning algorithm designed to be integrated with RAE. Additional details about both RAE and SeRPE are in Chapter 3 of our new book, Automated Planning and Acting.
منابع مشابه
Planning and Acting with Hierarchical Input/Output Automata
This paper introduces an original framework for planning and acting with hierarchical input/output automata for systems defined by the parallel composition of the models of their components. Typical applications are, for example, in harbor or warehouse automation. The framework extends the usual parallel composition operation of I/O automata with a hierarchical composition operation that can re...
متن کاملPlanning as Refinement Search: A unified framework for comparative analysis of Search Space Size and Performance
In spite of the long history of classical planning, there has been very little comparative analysis of the search space characteristics of the multitude of existing planning algorithms. This has seriously inhibited efforts to fruitfully intergrate various approaches. In this paper we show that viewing planning as a general refinement search provides a unified framework for comparing the search ...
متن کاملSolving Time-Dependent Planning Problems
A planning problem is time-dependent, if the time spent planning affects the uti l i ty of the system's performance. In [Dean and Boddy, 1988], we define a framework for constructing solutions to time-dependent planning problems, called expectation-driven iterative refinement. In this paper, we analyze and solve a moderately complex time-dependent planning problem involving path planning for a ...
متن کاملRefinement Planning: Status and Prospectus
Most current-day AI planning systems operate by iteratively refining a partial plan until it meets the goal requirements. In the past five years, significant progress has been made in our understanding of the spectrum and capabilities of such refinement planners. In this talk, I will summarize this understanding in terms of a unified framework for refinement planning and discuss several current...
متن کاملRefinement lanning: Status an
Most current-day AI planning systems operate by iteratively refining a partial plan until it meets the goal requirements. In the past five years, significant progress has been made in our understanding of the spectrum and capabilities of such refinement planners. In this talk, I will summarize this understanding in terms of a unified framework for refinement planning and discuss several current...
متن کامل